Greedy algae reduce arsenate

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Greedy decomposition integrals

In this contribution we define a new class of non-linear integrals based on decomposition integrals. These integrals are motivated by greediness of many real-life situations. Another view on this new class of integrals is that it is a generalization of both the Shilkret and PAN integrals. Moreover, it can be seen as an iterated Shilkret integral. Also, an example in time-series analysis is prov...

متن کامل

“Artifactual” arsenate DNA

The recent claim by Wolfe-Simon et al. that the Halomonas bacterial strain GFAJ-1 when grown in arsenate-containing medium with limiting phosphate is able to substitute phosphate with arsenate in biomolecules including nucleic acids and in particular DNA(1) arose much skepticism, primarily due to the very limited chemical stability of arsenate esters (see ref. 2 and references therein). A major...

متن کامل

Algae

Algae frequently get a bad press. Pond slime is a problem in garden pools, algal blooms can produce toxins that incapacitate or kill animals and humans and even the term seaweed is pejorative - a weed being a plant growing in what humans consider to be the wrong place. Positive aspects of algae are generally less newsworthy - they are the basis of marine food webs, supporting fisheries and char...

متن کامل

Totally Greedy Coin Sets and Greedy Obstructions

A coin set is a strictly increasing list of positive integers that always begins with 1. A coin set is called greedy when the simple greedy change-making algorithm always produces the fewest number of coins in change. Here, the greedy changemaking algorithm repeatedly selects the largest denomination coin less than the remaining amount until it has assembled the correct change. Pearson has prov...

متن کامل

Greedy metrics in orthogonal greedy learning

Orthogonal greedy learning (OGL) is a stepwise learning scheme that adds a new atom from a dictionary via the steepest gradient descent and build the estimator via orthogonal projecting the target function to the space spanned by the selected atoms in each greedy step. Here, “greed” means choosing a new atom according to the steepest gradient descent principle. OGL then avoids the overfitting/u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Limnology and Oceanography

سال: 2003

ISSN: 0024-3590

DOI: 10.4319/lo.2003.48.6.2275